منابع مشابه
Bi-Covering: Covering Edges with Two Small Subsets of Vertices
We study the following basic problem called Bi-Covering. Given a graph GpV,Eq, find two (not necessarily disjoint) sets A Ď V and B Ď V such that A Y B “ V and that every edge e belongs to either the graph induced by A or to the graph induced by B. The goal is to minimize maxt|A|, |B|u. This is the most simple case of the Channel Allocation problem [13]. A solution that outputs V,H gives ratio ...
متن کاملApproximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or vertices, respectively, of a graph. We consider the generalized partial cover version of these problems, in which failing to cover an edge, in the EDS case, or vertex, in the EC case, induces a penalty. The objective is ...
متن کاملLong and short covering edges in combination logic circuits
Absrracr-This paper extends the polynominal time algorithm obtained in [7] to find a minimal cardinality path set that long covers each lead or gate input of a digital logic circuit. The extension of this paper allows one to find, in polynominal time, a minimal cardinality path set that both long and short covers these leads or gate inputs.
متن کاملA stability theorem on fractional covering of triangles by edges
Let ν(G) denote the maximum number of edge-disjoint triangles in a graph G and τ(G) denote the minimum total weight of a fractional covering of its triangles by edges. Krivelevich proved that τ(G) ≤ 2ν(G) for every graph G. This is sharp, since for the complete graphK4 we have ν(K4) = 1 and τ (K4) = 2. We refine this result by showing that if a graph G has τ(G) ≥ 2ν(G) − x, then G contains ν(G)...
متن کاملCovering a bipartite graph with cycles passing through given edges
We propose a conjecture: for each integer k 2:: 2, there exists N (k) such that if G = (Vb \12; E) is a bipartite graph with IV11 = 1\121 = n 2: N(k) and d( x) + d(y) 2: n + k for each pair of non-adjacent vertices x and y of G with x E V1 and y E \12, then for any k independent edges el, ... , ek of G, there exist k vertex-disjoint cycles G1, ... , Gk in G such that ei E E(Gi ) for all i E {I,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2020
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21924